Efficient sets are small

NP-Hard Sets are Superterse Unless NP is Small

Constructing Small Sets that are Uniform in Arithmetic Progressions

Small Sets Satisfying the Central Sets Theorem

The Central Sets Theorem is a powerful theorem, one of whose consequences is that any central set in N contains solutions to any partition regular system of homogeneous linear equations. Since at least one set in any finite partition of N must be central, any of the consequences of the Central Sets Theorem must be valid for any partition of N. It is a result of Beiglböck, Bergelson, Downarowicz...

Small and Pseudo - Small Sets for Markov

Efficient representation of integer sets

We present a solution that uses bitmaps and bitwise operators to represent nonnegative integer sets and implement some common set theoretical operations. We also show how it is possible to extend this representation to set partitions.